Semigroups of positive integer vectors
نویسندگان
چکیده
منابع مشابه
Stochastic Dilation of Symmetric Completely Positive Semigroups
This is a continuation of the study of the theory of quantum stochastic dilation of completely positive semigroups on a von Neumann or C∗ algebra, here with unbounded generators. The additional assumption of symmetry with respect to a semifinite trace allows the use of the Hilbert space techniques, while the covariance gives rise to better handle on domains. An Evans-Hudson flow is obtained, di...
متن کاملPositive Implicative Ordered Filters of Implicative Semigroups
We introduce the notion of positive implicative ordered filters in implicative semigroups. We show that every positive implicative ordered filter is both an ordered filter and an implicative ordered filter. We give examples that an ordered filter (an implicative ordered filter) may not be a positive implicative ordered filter. We also give equivalent conditions of positive implicative ordered f...
متن کاملPositive Perturbations of Dual and Integrated Semigroups
Positive perturbations of generators of locally Lipschitz continuous increasing integrated semigroups on an abstract L space are again generators of locally Lipschitz continuous increasing integrated semigroups. Positive perturbations of generators of positive dual semigroups on a dual abstract L space are generators of semigroups that are weakly∗ right continuous. These results are reformulate...
متن کاملSolving Parity Games on Integer Vectors
We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (VASS) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a subclass of singlesided parity games o...
متن کاملFaster integer multiplication using short lattice vectors
We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is unconditional, and depends in an essential way on Minkowski's theorem concerning lattice vectors in symmetric convex sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1963
ISSN: 0386-2194
DOI: 10.3792/pja/1195523059